package rob;

public class Solution {
    public int rob(int[] nums) {
        // dp[i] = max(dp[i-2]+nums[i],dp[i-1]);
        int n = nums.length;
        int[] dp = new int[n];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0],nums[1]);
        for (int i = 2; i < n; i++) {
            dp[i] = Math.max(nums[i]+dp[i-2],dp[i-1]);
        }
        return dp[n-1];
    }
}
